Trees having an even or quasi even degree sequence are graceful
نویسندگان
چکیده
منابع مشابه
Trees having an even or quasi even degree sequence are graceful
A rooted tree with diameter D is said to have an even degree sequence if every vertex has even degree except for one root and the leaves, which are in the last level D/2 . The degree sequence is said to be quasi even if every vertex has even degree except for one root, every vertex in level D/2 − 1 and the leaves, which are in the last level D/2 . Hrnčiar and Haviar [P. Hrnčiar, A. Haviar, All ...
متن کاملOdd - Even Graceful Labeling for Different Paths using Padavon Sequence
A function f is called an odd-even graceful labeling of a graph G if f: V(G) → {0,1,2,...,q} is injective and the induced function f : E(G) → { { 0,2,4,...,2q+2i/i= 1 to n} such that when each edge uv is assigned the label |f(u) – f(v)| the resulting edge labels are {2,4,6,...,2q}. A graph which admits an odd-even graceful labeling is called an odd-even graceful graph. In this paper, the odd-ev...
متن کاملOdd or even on plane trees
Over all plane trees with n edges, the total number of vertices with odd degree is twice the number of those with odd outdegree. Deutsch and Shapiro posed the problem of 3nding a direct two-to-one correspondence for this property. In this article, we give three di5erent proofs via generating functions, an inductive proof and a two-to-one correspondence. Besides, we introduce two new sequences w...
متن کاملVisualizing a Sequence of a Thousand Graphs (or Even More)
The visualization of dynamic graphs demands visually encoding at least three major data dimensions: vertices, edges, and time steps. Many of the state-of-the-art techniques can show an overview of vertices and edges but lack a data-scalable visual representation of the time aspect. In this paper, we address the problem of displaying dynamic graphs with a thousand or more time steps. Our propose...
متن کاملOn Even-Degree Subgraphs of Linear Hypergraphs
A subgraph of a hypergraph H is even if all its degrees are positive even integers, and b-bounded if it has maximum degree at most b. Let fb(n) denote the maximum number of edges in a linear nvertex 3-uniform hypergraph which does not contain a b-bounded even subgraph. In this paper, we show that if b ≥ 12, then n logn 3b log logn ≤ fb(n) ≤ Bn(logn) for some absolute constant B, thus establishi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2007
ISSN: 0893-9659
DOI: 10.1016/j.aml.2006.04.020